package schoolEmployeeTest;

import java.util.ArrayList;
import java.util.Scanner;

/**
 * @ClassName huawei3
 * @description:
 * @author: 荣燊
 * @create: 2022-04-20 20:43
 **/
public class huawei3 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        // 创建二叉树
        String s1 = scanner.nextLine();
        ArrayList<Integer> atree = new ArrayList<>();
        for (int i = 0; i < s1.length(); i++) {
            if (s1.charAt(i) - '0' >= 0 && s1.charAt(i) - '0' <= 9) {
                atree.add(s1.charAt(i)-'0');
            }
        }
        int[] tree = new int[atree.size()];
        for (int k=0; k<tree.length; k++) {
            tree[k] = atree.get(k);
        }

        String s2 = scanner.nextLine();
        ArrayList<Character> bt = new ArrayList<>();
        for (int i = 0; i < s2.length(); i++) {
            if (s2.charAt(i) - '0' >= 0 && s2.charAt(i) - '0' <= 9) {
                bt.add(s2.charAt(i));
            }
        }
        StringBuffer node1 = new StringBuffer();
        for (int k=0; k<bt.size(); k++) {
            node1.append(bt.get(k));
        }
        String node = node1.toString();

        String s3 = scanner.nextLine();
        ArrayList<Integer> ct = new ArrayList<>();
        for (int i = 0; i < s3.length(); i++) {
            if (s3.charAt(i) - '0' >= 0 && s3.charAt(i) - '0' <= 9) {
                atree.add(s3.charAt(i)-'0');
            }
        }
        int[] newSonTree = new int[ct.size()];
        for (int k=0; k<newSonTree.length; k++) {
            newSonTree[k] = ct.get(k);
        }


    }

}
